vertex degree

См. также в других словарях:

• Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… …   Wikipedia

• Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …   Wikipedia

• Degree-constrained spanning tree — In graph theory, a degree constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree constrained spanning tree problem is to determine whether a particular graph has such a spanning …   Wikipedia

• Degree — may refer to: Contents 1 As a unit of measurement 2 In mathematics 3 In education …   Wikipedia

• Degree (graph theory) — A graph with vertices labeled by degree In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex, with loops counted twice.[1] The degree of a vertex …   Wikipedia

• Degree (mathematics) — This article is about the term degree as used in mathematics. For alternative meanings, see Degree (disambiguation). In mathematics, there are several meanings of degree depending on the subject. Contents 1 Unit of angle 2 Degree of a monomial 3… …   Wikipedia

• Vertex (graph theory) — For other uses, see Vertex (disambiguation). A graph with 6 vertices and 7 edges where the vertex number 6 on the far left is a leaf vertex or a pendant vertex In graph theory, a vertex (plural vertices) or node is the fundamental unit out of… …   Wikipedia

• Degree matrix — In the mathematical field of graph theory the degree matrix is a diagonal matrix which contains information about the degree of each vertex. It is used together with the adjacency matrix to construct the Laplacian matrix of a graph. Definition… …   Wikipedia

• Degree diameter problem — In graph theory, the degree diameter problem is the problem of finding the largest possible graph G (in terms of the size of its vertex set V) of diameter k such that the largest degree of any of the vertices in G is at most d. The size of G is… …   Wikipedia

• degree — noun Etymology: Middle English, from Anglo French degré, from Vulgar Latin *degradus, from Latin de + gradus Date: 13th century 1. a step or stage in a process, course, or order of classification < advanced by degrees > 2 …   New Collegiate Dictionary

• Feedback vertex set — In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… …   Wikipedia